Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
نویسندگان
چکیده
منابع مشابه
Solving Sparse Least Squares Problems on Massively Distributed Memory Computers
In this paper we study the parallel aspects of PCGLS, a basic iterative method whose main idea is to organize the computation of conjugate gradient method with preconditioner applied to normal equations, and Incomplete Modified Gram-Schmidt (IMGS) preconditioner for solving sparse least squares problems on massively parallel distributed memory computers. The performance of these methods on this...
متن کاملSolving a Sequence of Sparse Linear Least Squares Subproblems
We describe how to maintain an explicit sparse orthogonal factorization in order to solve the sequence of sparse linear least squares subproblems needed to implement an active-set method to solve the nonnegative least squares problem for a matrix with more columns than rows. In order to do that, we have adapted the sparse direct methodology of Björck and Oreborn of late 80s in a similar way to ...
متن کاملA Multilevel Block Incomplete Cholesky Preconditioner for Solving Rectangular Sparse Matrices from Linear Least Squares Problems
An incomplete factorization method for preconditioning symmetric positive definite matrices is introduced to solve normal equations. The normal equations are formed as a means to solve rectangular matrices from linear least squares problems. The procedure is based on a block incomplete Cholesky factorization and a multilevel recursive strategy with an approximate Schur complement matrix formed ...
متن کاملDealing with Dense Rows in the Solution of Sparse Linear Least Squares Problems
Sparse linear least squares problems containing a few relatively dense rows occur frequently in practice. Straightforward solution of these problems could cause catastrophic ll and delivers extremely poor performance. This paper studies a scheme for solving such problems eeciently by handling dense rows and sparse rows separately. How a sparse matrix is partitioned into dense rows and sparse ro...
متن کاملSolving Sparse Linear Least Squares Problems on Some Supercomputers by Using a Sequence of Large Dense Blocks
It is relatively easy to obtain good computational speed on many high-speed computers when computations with dense matrix techniques are performed. This explains why very eecient subroutines have been developed for dense matrix computations. On some computers, as on the new CRAY models, the speed obtained in this situation is near the top-performance given by the manifactures. However, both the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2019
ISSN: 1064-8275,1095-7197
DOI: 10.1137/18m1181353